New Techniques for Exact and Approximate Dynamic Closest-Point Problems
نویسندگان
چکیده
منابع مشابه
Communication-Efficient Search for an Approximate Closest Lattice Point
We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost and (ii) obtain the error probability. The approximate closest lattice point considered here is the one obtained using the nearest-plane (Babai) algorithm. ...
متن کاملA Consistent and Accurate Numerical Method for Approximate Numerical Solution of Two Point Boundary Value Problems
In this article we have proposed an accurate finite difference method for approximate numerical solution of second order boundary value problem with Dirichlet boundary conditions. There are numerous numerical methods for solving these boundary value problems. Some these methods are more efficient and accurate than others with some advantages and disadvantages. The results in experiment on model...
متن کاملClosest-Point Problems in Computational Geometry
Michiel Smid Fakult at f ur Informatik Otto-von-Guericke-Universitat Magdeburg Universitatsplatz 2 D-39106 Magdeburg, Germany E-mail: [email protected] September 1, 1997 Abstract This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data s...
متن کاملNew bounds for range closest-pair problems
Given a dataset S of points in R, the range closest-pair (RCP) problem aims to preprocess S into a data structure such that when a query range X is specified, the closest-pair in S ∩ X can be reported efficiently. The RCP problem can be viewed as a range-search version of the classical closestpair problem, and finds applications in many areas. Due to its non-decomposability, the RCP problem is ...
متن کاملAn approximate EM Homographical Iterative Closest Point algorithm
This paper describes an approximately expectationmaximization (EM) formulation of a homographical iterative closest point registration approach (henceforth HICP). We show that such an EM approach allows the algorithm to converge faster, and more robustly in the presence of noise. Although this algorithm can register points transformed by a more general set of linear transformations than the ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1996
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539793259458